import java.util.Queue;

class MyCircularQueue {

    private int[] elem;
    private int front;
    private int rear;

    public MyCircularQueue(int k) {
        //因为我们浪费了一个空间来区别队列满没满
        //所以要多初始化一个空间
        this.elem = new int[k + 1];
    }

    //入队
    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1) % elem.length;
        return true;
    }

    //出队
    public boolean deQueue() {
        //1.空的，不能出
        if (isEmpty()) {
            return false;
        }
        //2.不空，front就往后走
        front = (front + 1) % elem.length;
        return true;
    }

    //得到队头元素
    public int Front() {
        if (isEmpty()) {
            return -1;
        }
        return elem[front];
    }

    //得到队尾元素
    public int Rear() {
        if (isEmpty()) {
            return -1;
        }
        int index = (rear == 0) ? (elem.length - 1) : (rear - 1);
        return elem[index];
    }

    public boolean isEmpty() {
        if (rear == front) {
            return true;
        }
        return false;
    }

    public boolean isFull() {
        if ((rear + 1) % elem.length == front) {
            return true;
        }
        return false;
    }
}